منابع مشابه
The Cycle-Complete Graph Ramsey Numbers
In 1978 Erdős, Faudree, Rousseau, and Schelp conjectured that r (Cp, Kr) = (p − 1) (r − 1) + 1. for every p ≥ r ≥ 3, except for p = q = 3. This has been proved for r ≤ 6, and for p ≥ r 2 − 2r. In this note we prove the conjecture for p ≥ 4r + 2.
متن کاملOn cycle - Complete graph ramsey numbers
A new upper bound is given for the cycle-complete graph Ramsey number r(C,,,, K„), the smallest order for a graph which forces it to contain either a cycle of order m or a set of ri independent vertices . Then, another cycle-complete graph Ramsey number is studied, namely r( :C,,,, K„) the smallest order for a graph which forces it to contain either a cycle of order 1 for some I satisfying 3 :1...
متن کاملOn a conjecture involving cycle-complete graph Ramsey numbers
It has been conjectured that r(Cnl Km) = (m 1)(n 1) + 1 for all (n, m) =1= (3,3) satisfying n ~ m. We prove this for the case m = 5. * This author is currently pursuing post-doctoral studies under Prof. Bollobas Australasian Journal of Combinatorics 22(2000), pp.63-71
متن کاملAll cycle-complete graph Ramsey numbers r(Cm, K6)
The cycle-complete graph Ramsey number r (Cm,Kn ) is the smallest integer N such that every graph G of order N contains a cycle Cm on m vertices or has independence number (G) n. It has been conjectured by Erdős, Faudree, Rousseau and Schelp that r (Cm,Kn )1⁄4 (m 1) (n 1)þ 1 for all m n 3 (except r (C3,K3 )1⁄4 6). This conjecture holds for 3 n 5: In this paper we will present a proof for n 1⁄4 ...
متن کاملA Note on Odd Cycle-Complete Graph Ramsey Numbers
The Ramsey number r(Cl,Kn) is the smallest positive integer m such that every graph of order m contains either cycle of length l or a set of n independent vertices. In this short note we slightly improve the best known upper bound on r(Cl,Kn) for odd l.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Algebra
سال: 2011
ISSN: 2090-6285,2090-6293
DOI: 10.5402/2011/926191